Standard binary derivative complexity for the test randomness of finite binary sequence.
نویسندگان
چکیده
منابع مشابه
Binary Masses as a Test for Pre–Main-Sequence Tracks
Observations of binaries have traditionally provided the means for ascertaining stellar masses. Here, we use the published data on 8 pre–main-sequence pairs to gauge the accuracy of our own, recently calculated, evolutionary tracks (Palla & Stahler 1999). We consider both eclipsing, double-lined spectroscopic binaries, which provide the mass of each star separately, and non-eclipsing, double-li...
متن کاملTest for submodel in Gibbs-Markov binary random sequence
Institute of Mathematics of the Academy of Sciences of the Czech Republic provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use. This paper has been digitized, optimized for electronic delivery and stamped with digital signature within the project DML-CZ: The Czech Digital Mathematics Library The Gibbs-Markov ran...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملAlgorithmic Complexity and Stochastic Properties of Finite Binary Sequences
This paper is a survey of concepts and results related to simple Kolmogorov complexity, prefix complexity and resource-bounded complexity. We also consider a new type of complexity— statistical complexity closely related to mathematical statistics. Unlike other discoverers of algorithmic complexity, A. N. Kolmogorov’s leading motive was developing on its basis a mathematical theory more adequat...
متن کاملFinite-State Complexity and Randomness
In this paper we develop a version of Algorithmic Information Theory (AIT) by replacing Turing machines with finite transducers; the complexity induced is called finite-state complexity. In spite of the fact that the Universality Theorem (true for Turing machines) is false for finite transducers, we show that the set of finite transducers can be enumerated by a prefix-free regular set, and, as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Cybernetics
سال: 2012
ISSN: 1813-9663,1813-9663
DOI: 10.15625/1813-9663/19/1/1522